翻訳と辞書 |
Directed acyclic word graph : ウィキペディア英語版 | Directed acyclic word graph
In computer science, a directed acyclic word graph (DAWG) is a data structure that represents the set of all substrings of a string. As its name implies, a DAWG takes the form of a directed acyclic graph; it can also be viewed as a deterministic finite automaton, and is similar in structure to suffix trees. DAWG have applications in approximate string matching. ==See also==
* GADDAG * Suffix array
抄文引用元・出典: フリー百科事典『 ウィキペディア(Wikipedia)』 ■ウィキペディアで「Directed acyclic word graph」の詳細全文を読む
スポンサード リンク
翻訳と辞書 : 翻訳のためのインターネットリソース |
Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.
|
|